Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Sinogram inpainting for sparse-view cone-beam computed tomography image reconstruction based on residual encoder-decoder generative adversarial network
Xin JIN, Yangchuan LIU, Yechen ZHU, Zijian ZHANG, Xin GAO
Journal of Computer Applications    2023, 43 (6): 1950-1957.   DOI: 10.11772/j.issn.1001-9081.2022050773
Abstract279)   HTML8)    PDF (5739KB)(194)       Save

Sparse-view projection can reduce the scan does and scan time of Cone-Beam Computed Tomography (CBCT) effectively but brings a lot of streak artifacts to the reconstructed images. Sinogram inpainting can generate projection data for missing angles and improve the quality of reconstructed images. Based on the above, a Residual Encoder-Decoder Generative Adversarial Network (RED-GAN) was proposed for sinogram inpainting to reconstruct sparse-view CBCT images. In this network, the U-Net generator in Pix2pixGAN (Pix2pix Generative Adversarial Network) was replaced with the Residual Encoder-Decoder (RED) module. In addition, the conditional discriminator based on PatchGAN (Patch Generative Adversarial Network) was used to distinguish between the repaired sinograms from the real sinograms, thereby further improving the network performance. After the network training using real CBCT projection data, the proposed network was tested under 1/2, 1/3 and 1/4 sparse-view sampling conditions, and compared with linear interpolation method, Residual Encoder-Decoder Convolutional Neural Network (RED-CNN) and Pix2pixGAN. Experimental results indicate that the sinogram inpainting results of RED-GAN are better than those of the comparison methods under all the three conditions. Under the 1/4 sparse-view sampling condition, the proposed network has the most obvious advantages. In the sinogram domain, the proposed network has the Root Mean Square Error (RMSE) decreased by 7.2%, Peak Signal-to-Noise Ratio (PSNR) increased by 1.5% and Structural Similarity (SSIM) increased by 1.4%; in the reconstructed image domain, the proposed network has the RMSE decreased by 5.4%, PSNR increased by 1.6% and SSIM increased by 1.0%. It can be seen that RED-GAN is suitable for high-quality CBCT reconstruction and has potential application value in the field of fast low-dose CBCT scanning.

Table and Figures | Reference | Related Articles | Metrics
Improved capsule network based on multipath feature
Qinghai XU, Shifei DING, Tongfeng SUN, Jian ZHANG, Lili GUO
Journal of Computer Applications    2023, 43 (5): 1330-1335.   DOI: 10.11772/j.issn.1001-9081.2022030367
Abstract335)   HTML40)    PDF (1560KB)(248)       Save

Concerning the problems of poor classification of Capsule Network (CapsNet) on complex datasets and large number of parameters in the routing process, a Capsule Network based on Multipath feature (MCNet) was proposed, including a novel capsule feature extractor and a novel capsule pooling method. By the capsule feature extractor, the features of different layers and locations were extracted in parallel from multiple paths, and then the features were encoded into capsule features containing more semantic information. In the capsule pooling method, the most active capsules at each position of the capsule feature map were selected, and the effective capsule features were represented by a small number of capsules. Comparisons were performed on four datasets (CIFAR-10, SVHN, Fashion-MNIST, MNIST) with models such as CapsNet. Experimental results show that MCNet has the classification accuracy of 79.27% on CIFAR-10 dataset and the number of trainable parameters of 6.25×106; compared with CapsNet, MCNet has the classification accuracy improved by 8.7%, and the number of parameters reduced by 46.8%. MCNet can effectively improve the classification accuracy while reducing the number of trainable parameters.

Table and Figures | Reference | Related Articles | Metrics
Rotary machine fault diagnosis based on improved residual convolutional auto-encoding network and class adaptation
Jian ZHANG, Peiyuan CHENG, Siyu SHAO
Journal of Computer Applications    2022, 42 (8): 2440-2449.   DOI: 10.11772/j.issn.1001-9081.2021060905
Abstract231)   HTML10)    PDF (1320KB)(52)       Save

Aiming at the insufficient deep network model training problem caused by limited rotary machine sensor signal samples, a fault diagnosis model combining improved residual convolutional auto-encoding network and class adaption method was proposed to deal with the data with small sample size. Firstly, paired samples were created by a small number of labeled source domain data and target domain data, and an improved one-dimensional residual convolutional auto-encoding network was designed to extract features from two types of original vibration signals with different distributions. Secondly, the Maximum Mean Discrepancy (MMD) was used to reduce the distribution difference, and the data space of the same fault category from two domains was mapped to a common feature space. Finally, the accurate fault diagnosis was realized. Experimental results show that the proposed model is able to effectively improve the fault diagnosis accuracy of the target domain vibration data with few labels under different working conditions compared with the fine-tuning and domain adaptation methods.

Table and Figures | Reference | Related Articles | Metrics
Analysis of complex spam filtering algorithm based on neural network
Jian ZHANG, Ke YAN, Xiang MA
Journal of Computer Applications    2022, 42 (3): 770-777.   DOI: 10.11772/j.issn.1001-9081.2021040791
Abstract328)   HTML14)    PDF (610KB)(136)       Save

The recognition of spam is one of the main tasks in natural language processing. The traditional methods are based on text features or word frequency, which recognition accuracies mainly depend on the presence or absence of specific keywords. When there are no keywords or errors in recognizing keywords in the spam, the traditional methods have poor recognition performance. Neural network-based methods were proposed. Recognition training and testing were conducted on complex spam. The spams that cannot be recognized by traditional methods were collected and the same amount of normal information was randomly selected from spam messages, advertisement and spam email datasets to form three new datasets without duplicate data. Three models were proposed based on convolutional neural network and recurrent neural network and tested on three new datasets for spam recognition. The experimental results show that the neural network-based models learned better semantic features from the text and achieved the accuracies of more than 98% on all three datasets, which are significantly higher than those of the traditional methods, such as Naive Bayes (NB), Random Forest (RF) and Support Vector Machine (SVM). The experimental results also show that different neural networks are suitable for text classification with different lengths. The models composed of recurrent neural networks are good at recognizing text with sentence length, the models composed of convolutional neural networks are good at recognizing text with paragraph length, and the models composed of both neural networks are good at recognizing text with chapter length.

Table and Figures | Reference | Related Articles | Metrics
Several novel intelligent optimization algorithms for solving constrained engineering problems and their prospects
Mengjian ZHANG, Deguang WANG, Min WANG, Jing YANG
Journal of Computer Applications    2022, 42 (2): 534-541.   DOI: 10.11772/j.issn.1001-9081.2021020265
Abstract477)   HTML32)    PDF (849KB)(294)       Save

To study the performance and application prospects of novel intelligent optimization algorithms, six bionic intelligent optimization algorithms proposed in the past few years were analyzed, concluding Harris Hawks Optimization (HHO) algorithm, Equilibrium Optimizer (EO), Marine Predators Algorithm (MPA), Political Optimizer (PO), Slime Mould Algorithm (SMA), and Heap-Based Optimizer (HBO). Their performance and applications in different constrained engineering optimization problems were compared and analyzed. Firstly, the basic principles of six optimization algorithms were introduced. Secondly, the optimization tests were performed on ten standard benchmark functions for six optimization algorithms. Thirdly, six optimization algorithms were applied to solve three engineering optimization problems with constraints. Experimental results show that the convergence accuracy of PO is the best for the optimization of unimodal and multimodal test functions and can reach the theoretical optimal value zero many times. The EO and MPA are better for solving constrained engineering problems with fast optimization speed, high stability and standard deviation of a small order of magnitude. Finally, the improvement methods and development potentials of six optimization algorithms were analyzed.

Table and Figures | Reference | Related Articles | Metrics
Path planning for intelligent robots based on improved particle swarm optimization algorithm
ZHANG Wanjian ZHANG Xianglan LI Ying
Journal of Computer Applications    2014, 34 (2): 510-513.  
Abstract687)      PDF (593KB)(1108)       Save
As regards the poor local optimization ability of Particle Swarm Optimization (PSO), a nonlinear dynamic adjusting inertia weight was put forward to improve the particle swarm path planning algorithm. This algorithm combined the grid method and particle swarm algorithm, introduced the two concepts of safety and smoothness based on path length, and established dynamic adjustment path length of the fitness function. Compared with the traditional PSO. The experimental results show that the improved algorithm has stronger security, real-time and optimization ability.
Related Articles | Metrics
Gas emission prediction model of working face based on chaos immune particle swarm optimizations and generalized regression neural network
WANG Yuhong FU Hua HOU Fujian ZHANG Yang
Journal of Computer Applications    2014, 34 (11): 3348-3352.   DOI: 10.11772/j.issn.1001-9081.2014.11.3348
Abstract155)      PDF (739KB)(569)       Save

To improve the accuracy and efficiency of absolute gas emission prediction, a new algorithm based on Chaos Immune Particle Swarm Optimization (CIPSO) and General Regression Neural Network (GRNN) was proposed. In this algorithm, CIPSO was employed to dynamically optimize the smooth factor of GRNN to reduce the impact of artificial factors in GRNN model construction, and then the optimized network was adopted to establish gas emission prediction model. The simulation experiment results on gas emission data of a coal mine show that the model is of faster convergence and higher prediction accuracy than other prediction models based on BP and Elman neural network. It is proved that the proposed method is feasible and effective.

Reference | Related Articles | Metrics
Dual-scale fabric defect detection based on sparse coding
ZHANG Longjian ZHANG Zhuo FAN Ci'en DENG Dexiang
Journal of Computer Applications    2014, 34 (10): 3009-3013.   DOI: 10.11772/j.issn.1001-9081.2014.10.3009
Abstract268)      PDF (778KB)(387)       Save

Defect detection is an important part of fabric quality control. To make the detection algorithm possess good commonality and high detection accuracy, a dual-scale fabric defect detection algorithm based on sparse coding was proposed. The algorithm combined the advantage of high stability under large-scale and the advantage of high detection sensitivity under small-scale. At first, the dictionaries under large and small scales were obtained through a small-scale over-complete dictionary training method. Then, the projection of detection image block on the over-complete dictionary was used to extract detection characteristics. Finally, the detection results under dual-scale were fused by the means of distance fusion. The algorithm overcame the disadvantage of large computation because of the introduction of dual-scale while using small-scale over-complete dictionary and downsampling the detection image under large-scale. TILDA Textile Texture Data base was used in the experiment. The experimental results show that the algorithm can effectively detect defects on plain, gingham and striped fabric, the comprehensive detection rate achieves 95.9%. And its moderate amount of calculation can satisfy the requirement of industrial real-time detection, so it does have much value of practical application.

Reference | Related Articles | Metrics
Distributed intrusion detection model based on artificial immune
CHENG Jian ZHANG Mingqing LIU Xiaohu FAN Tao
Journal of Computer Applications    2014, 34 (1): 86-89.   DOI: 10.11772/j.issn.1001-9081.2014.01.0086
Abstract553)      PDF (727KB)(449)       Save
Concerning the problem of excessive interaction flow, single point failure and low detection efficiency in existing Distributed Intrusion Detection System (DIDS), a new distributed intrusion detection model based on artificial immune theory was proposed. The new distributed intrusion detection model presented a central detector configuration and method of use and combined misuse detection and anomaly detection. The simulation model was designed based on OMNeT+〖KG-*3〗+ network simulation platform and experiments were run. According to the simulation results, the model overcomes excessive interaction flow problem of the fully distributed system, solves the problem of single point failure and improves the detection efficiency effectively. The simulation results verify the validity and effectiveness of the improved model.
Related Articles | Metrics
New inverted index storage scheme for Chinese search engine
MA Jian ZHANG Taihong CHEN Yanhong
Journal of Computer Applications    2013, 33 (07): 2031-2036.   DOI: 10.11772/j.issn.1001-9081.2013.07.2031
Abstract738)      PDF (844KB)(693)       Save
After analyzing inverted index structure and access mode of an open source search engine-ASPSeek, this paper gave an abstract definition of "inverted index". In order to solve the difficulties of inverted index updating and the efficiency issues caused by directly accessing inverted index through file caching of operating system in ASPSeek, considering the characteristics of 1.25 million Chinese agricultural Web pages, this article proposed a new blocking inverted index storage scheme with a buffer mechanism which was based on CLOCK replacement algorithm. The experimental results show that the new scheme is more efficient than ASPSeek whether the buffer system is disabled or enabled. When the buffer system got enabled and 160 thousand Chinese terms or 50 thousand high-frequency Chinese terms were used as a test set, the retrieval time of new scheme tended to be a constant after one million accesses. Even when using entire 827309 terms as a test set, the retrieval time of new scheme began to converge after two million accesses.
Reference | Related Articles | Metrics
C/S structured questions survey system based on JSP and Android
CHEN Wangting LIN Manzu CHEN Jian ZHANG Yue FU Qijia ZHU Leqing
Journal of Computer Applications    2013, 33 (03): 886-889.   DOI: 10.3724/SP.J.1087.2013.00886
Abstract945)      PDF (616KB)(1015)       Save
In order to facilitate the execution of the questionnaire survey, and to improve the efficiency of the statistical data collection, this paper proposed a method to realize a questionnaire survey system based on the Android platform running on mobile phone. The survey system was C/S structured. The server included a questions design module based on Java Server Page (JSP), a result statistical module, the database and the C#-based Web service that gave interfaces to access database. The client was implemented on Android platform, which acquired information of the questions from the database, and displayed questions and their options on the screen for users to answer. When the user completed the answer to the questions, the client would write the answers back to the database. This system was first tested on Android emulator, and then on the mobile phone. The testing results indicate that questions survey function has been efficiently realized in the system. Moreover, since the client can run on a mobile device, the survey process can be carried out freely anywhere, anytime, which means that the survey process would not only be convenient and efficient, but also broaden the target clients of the survey system. The proposed system could be adopted by enterprises or organizations to carry out market or social investigations.
Reference | Related Articles | Metrics
Correlation adaptive compressed sensing of wireless sensor network data
ZHOU Jian ZHANG Mingxin
Journal of Computer Applications    2013, 33 (02): 374-389.   DOI: 10.3724/SP.J.1087.2013.00374
Abstract1020)      PDF (738KB)(461)       Save
In order to eliminate the influence of varying correlation of Wireless Sensor Network (WSN) data caused by transmission in the performance of the current Compressed Sensing (CS) reconstruction algorithms, a correlation adaptive reconstruction algorithm for network data was proposed. Firstly, the iterative algorithm was used to estimate the correlation of the date to be reconstructed, then two-step correlation of support set were used for coordinating the non-zero value in sparse coefficient vector, and eventually a more precise reconstruction of data was realized. The simulation result shows that this algorithm can effectively restrain the effect of noises in WSN data reconstruction and improve the accuracy of reconstruction under varying correlation.
Related Articles | Metrics
Theoretical study on bandwidth utilization in FlexRay network
WANG Gang DING Tian-bao RONG Jian ZHANG Zhuo Lü Yi-bin
Journal of Computer Applications    2011, 31 (10): 2634-2637.   DOI: 10.3724/SP.J.1087.2011.02634
Abstract1030)      PDF (594KB)(531)       Save
To improve the bandwidth utilization of a FlexRay network, it is necessary to gain a deep insight into this performance parameter. Based upon current model for time parameter optimization in a FlexRay network, through reducing a nonlinear operator to a linear one, analytical expressions of the optimal payload length of static frame and the maximum bandwidth utilization in the static segment of a FlexRay network were derived. The numerical experiments verify the validity of the analytical expressions, and demonstrate that the obtained analytical formulae are capable of providing an exact calculation for the bandwidth utilization in a FlexRay network.
Related Articles | Metrics
Application-layer multicast algorithm based on maximum interference network coding
Yong-guang LIU Jian ZHANG Ruo-he YAO
Journal of Computer Applications    2011, 31 (07): 1959-1961.   DOI: 10.3724/SP.J.1087.2011.01959
Abstract1217)      PDF (599KB)(866)       Save
The application-layer multicast in end-system has overwhelming advantages compared with network-layer multicast. For improving the efficiency and performance of application-layer multicast, a multicast algorithm based on maximum interference network coding was presented. After adopting network coding, the new algorithm selected the maximum interference paths from source to every destination to improve coding efficiency and save network bandwidth. The simulations show that compared with non-coding multicast and simple network coding multicast algorithm, the new algorithm performs better in network throughout put and resource utilization.
Reference | Related Articles | Metrics
Double-layered embedding based wet-paper-code adaptive steganography
XI Ling PING Xi-jian ZHANG Tao
Journal of Computer Applications    2011, 31 (05): 1280-1283.   DOI: 10.3724/SP.J.1087.2011.01280
Abstract1293)      PDF (645KB)(1097)       Save
In order to enhance the statistical security of a data hiding system, the factors that influenced the security of a steganography were analyzed. Three ways to reduce the statistical distortion of the stego-image were found: Increasing embedding efficiency, controlling modifying amplitude and choosing embedding position adaptively. According to the three ways, a new adaptive steganography based on double-layered embedding method was proposed. The new scheme chose pixels under strong noise background as message carrier and embedded secrets in their least significant and second least significant bit-planes. The experimental results on uncompressed images show that the proposed steganography outperforms the prior algorithm for resisting blind steganalysis.
Related Articles | Metrics
Realization of multiprocessor scheduling algorithm and its modeling simulation based on Petri net
Yi-qi WANG Qing-kun LIU Jian ZHANG
Journal of Computer Applications    2011, 31 (04): 938-941.   DOI: 10.3724/SP.J.1087.2011.00938
Abstract1175)      PDF (594KB)(451)       Save
Multiprocessor scheduling algorithm is the key in the embedded real-time systems. According to the multiprocessor features, a new dynamic parallel scheduling algorithm of real-time multiprocessor, named Split-Parallel (SPara), was proposed. The algorithm solved the problem that the previous algorithms, such as Myopic, EDPF, only judge by the deadline to schedule the tasks, and it was also developed by adding the restriction of the urgency and an effective method as the task with long execution time and tight deadline. Furthermore, the multiprocessor scheduling algorithm which combined the theory of high-level coloured time Petri net was analyzed by modeling, and according to the model, an example of SPara algothrim was simulated and tested. The experimental results show that SPara performances are much better than the other algorithms like Myopic in processor utilization and scheduling success ratio.
Related Articles | Metrics
Method of calculating stack space of μC/OS-II task based on tree structure and its application
Guang-jian ZHANG Zheng LIU
Journal of Computer Applications   
Abstract1638)      PDF (547KB)(721)       Save
Aiming at the problem that the stack space size of μC/OS-II task is not easily confirmed by existing ways, this paper presented a new way by which the stack space size of μC/OS-II task can be computed based on tree structure. Firstly, the stack space structure of μC/OS-II task was analyzed. Secondly, some tree structures that can show the extreme usage of the stack space were defined. Lastly, the formula that can calculate the stack space which is maximal was presented based on tree structure and the stack space of a real system was calculated by the formula. The stack space size which is calculated by this way can reflect the extreme usage of a stack space factually and can reduce the requirement for RAM.
Related Articles | Metrics
Even scrambling algorithm of image position based on Arnold cat transformation
Jian ZHANG Xiao-yang YU Hong-e REN
Journal of Computer Applications    2009, 29 (11): 2960-2963.  
Abstract1423)      PDF (1926KB)(1063)       Save
Arnold cat transformation is widely applied and has the best scrambling effect. However, it has some disadvantages, such as small key quantities and poor generalizability. From the scrambling essential, the concept of even scrambling was presented. At the same time, an algorithm of image position scrambling on the basis of improving Arnold cat transformation was put forward. The experimental results show that the key quantities and scrambling effect of the proposed algorithm are improved obviously, and it can resist cut attack.
Related Articles | Metrics
Efficient beam search decoder for phrase-based statistical machine translation
Yi Luo Miao Li Jian Zhang
Journal of Computer Applications   
Abstract1443)      PDF (643KB)(802)       Save
An efficient beam search decoder for phrase-based statistical machine translation was described. The efficiency of search algorithm is the key to decoding process. After introducing the conventional beam search decoding algorithm, some efficiency improving measures were proposed. Dynamic pruning strategy enhanced the accuracy of pruning by improving that the original fixed pruning had not enough response to the current situation of search. Pre-pruning strategy was used to limit the poor sprawl, reduce unnecessary expansion and improve search speed. A rapid reordering constrains strategy was presented based on the research of the current major reordering constrains. In addition, the domain term always has the only translation, so a special process approach was put forward to improve the accuracy of the translation. Comparative analysis of the experimental results proves the effectiveness of the algorithm.
Related Articles | Metrics
Associative classification algorithm based on support and confident thresholds tuning technique
Jian Zhang
Journal of Computer Applications   
Abstract1600)            Save
The set of the support and confident thresholds usually affects the accuracy of classification based on association rules. As for the previous associative classification algorithms, the two thresholds are always set by experiences, so it is difficult to ensure that the classifier can always get the best accuracy. In order to solve this problem, the optimization strategies can be introduced to associative classification algorithm. The hill climbing search method was used to improve the Apriori_TFP_CMAR algorithm to get the highest classification accuracy of the set of support and confidence thresholds. This strategy can avoid the unreasonable set of threshold, and enhance the classification accuracy.
Related Articles | Metrics